منابع مشابه
On Edge-Colored Saturation Problems
Let C be a family of edge-colored graphs. A t-edge colored graph G is (C, t)saturated if G does not contain any graph in C but the addition of any edge in any color in [t] creates a copy of some graph in C. Similarly to classical saturation functions, define satt(n, C) to be the minimum number of edges in a (C, t) saturated graph. Let Cr(H) be the family consisting of every edge-colored copy of...
متن کاملPacking Problems in Edge-colored Graphs
Let F be a fixed edge-colored graph. We consider the problem of packing the greatest possible number of vertex disjoint copies of F into a given complete edge-colored graph. We observe that this problem is NP-hard unless F consists of isolated vertices and edges or unless there are only two colors and F is properly 2-edge-colored. Of the remaining problems we focus on the case where F is a prop...
متن کاملOn Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2020
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2020.v11.n4.a4